#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
    int MLS(vector<int>& arr)
    {
        sort(arr.begin(), arr.end());
        int ret = 0;
        for (int i = 0; i < arr.size();)
        {
            int j = i + 1, count = 1;
            while (j < arr.size())
            {
                if (arr[j] - arr[j - 1] == 1)
                {
                    count++;
                    j++;
                }
                else if (arr[j] - arr[j - 1] == 0)
                {
                    j++;
                }
                else
                {
                    break;
                }
            }
            ret = max(ret, count);
            i = j;
        }
        return ret;
    }
};


#include <iostream>
using namespace std;

const int N = 510;
char g[N][N];
int arr[N][N];
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> g[i][j];
        }
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            int cnt = 0;
            if (g[i][j] == 'l') cnt = 4;
            else if (g[i][j] == 'o') cnt = 3;
            else if (g[i][j] == 'v') cnt = 2;
            else if (g[i][j] == 'e') cnt = 1;

            arr[i][j] = max(arr[i - 1][j], arr[i][j - 1]) + cnt;
        }
    }
    cout << arr[n][m] << endl;
    return 0;
}


#include <iostream>
#include <string>
using namespace std;
int main()
{
    string s;
    cin >> s;
    int begin = -1, len = 0;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] >= '0' && s[i] <= '9')
        {
            int j = i;
            while (j < s.size() && s[j] >= '0' && s[j] <= '9') j++;
            if (j - i > len)
            {
                begin = i;
                len = j - i;
            }
            i = j;
        }
    }
    if (begin == -1) cout << "" << endl;
    else cout << s.substr(begin, len) << endl;
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
int t;
int arr[6];
int main()
{
    cin >> t;
    while (t--)
    {
        for (int i = 0; i < 6; i++) cin >> arr[i];
        sort(arr, arr + 6);
        if (arr[0] + arr[1] > arr[2] && arr[3] + arr[4] > arr[5] ||
            arr[0] + arr[2] > arr[3] && arr[1] + arr[4] > arr[5] ||
            arr[0] + arr[3] > arr[4] && arr[1] + arr[2] > arr[5] ||
            arr[0] + arr[4] > arr[5] && arr[1] + arr[2] > arr[3])
        {
            cout << "Yes" << endl;
        }
        else cout << "No" << endl;
    }

    return 0;
}


#include <iostream>
using namespace std;
int gcd(int a, int b)
{
    if (b == 0) return a;
    return gcd(b, a % b);
}
int main()
{
    int a, b;
    cin >> a >> b;
    cout << (a * b / gcd(a, b)) << endl;
    return 0;
}